2 research outputs found
Robustness-optimized quantum error correction
Quantum error correction codes are usually designed to correct errors
regardless of their physical origins. In large-scale devices, this is an
essential feature. In smaller-scale devices, however, the main error sources
are often understood, and this knowledge could be exploited for more efficient
error correction. Optimizing the quantum error correction protocol is therefore
a promising strategy in smaller devices. Typically, this involves tailoring the
protocol to a given decoherence channel by solving an appropriate optimization
problem. Here we introduce a new optimization-based approach, which maximizes
the robustness to faults in the recovery. Our approach is inspired by recent
experiments, where such faults have been a significant source of logical
errors. We illustrate this approach with a three-qubit model, and show how
near-term experiments could benefit from more robust quantum error correction
protocols.Comment: 10 pages, 4 figures, RevTeX 4.1. v2: Updated to match published
versio
Parallel Five-Cycle Counting Algorithms
Counting the frequency of subgraphs in large networks is a classic research question that reveals the underlying substructures of these networks for important applications. However, subgraph counting is a challenging problem, even for subgraph sizes as small as five, due to the combinatorial explosion in the number of possible occurrences. This paper focuses on the five-cycle, which is an important special case of five-vertex subgraph counting and one of the most difficult to count efficiently.
We design two new parallel five-cycle counting algorithms and prove that they are work-efficient and achieve polylogarithmic span. Both algorithms are based on computing low out-degree orientations, which enables the efficient computation of directed two-paths and three-paths, and the algorithms differ in the ways in which they use this orientation to eliminate double-counting. We develop fast multicore implementations of the algorithms and propose a work scheduling optimization to improve their performance. Our experiments on a variety of real-world graphs using a 36-core machine with two-way hyper-threading show that our algorithms achieves 10-46x self-relative speed-up, outperform our serial benchmarks by 10-32x, and outperform the previous state-of-the-art serial algorithm by up to 818x